#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll t;
cin>>t;
while(t--){
ll n,ans=0,c=0,mx=0;
cin>>n;
vector<ll>ar(n),a;
for(ll i=0;i<n;i++){
cin>>ar[i];
}
for(ll i=0;i<n;i++){
if(ar[i]==1){
c++;
mx++;
ans=max(ans,mx);
}
else{
if(c>=3){
mx=c/2+1;
}
}
}
cout<<ans<<"\n";
}
return 0;
}
1516B - AGAGA XOOORRR | 1515A - Phoenix and Gold |
1515B - Phoenix and Puzzle | 155A - I_love_username |
49A - Sleuth | 1541A - Pretty Permutations |
1632C - Strange Test | 673A - Bear and Game |
276A - Lunch Rush | 1205A - Almost Equal |
1020B - Badge | 1353A - Most Unstable Array |
770A - New Password | 1646B - Quality vs Quantity |
80A - Panoramix's Prediction | 1354B - Ternary String |
122B - Lucky Substring | 266B - Queue at the School |
1490A - Dense Array | 1650B - DIV + MOD |
1549B - Gregor and the Pawn Game | 553A - Kyoya and Colored Balls |
1364A - XXXXX | 1499B - Binary Removals |
1569C - Jury Meeting | 108A - Palindromic Times |
46A - Ball Game | 114A - Cifera |
776A - A Serial Killer | 25B - Phone numbers |